Dynamic resource repositioning load balancing and location management system and method

ABSTRACT

A dynamic resource repositioning load balancing and location management system repositions an incoming resource in a grid network of nodes. The system includes a first mapping device to map topology of said gird network of nodes, along with its resources; a determination device to determine at least an incoming resource&#39;s initial placement in terms of relative position of said node that the resource currently occupies and in terms of relative number of edges on which said resource currently resides; and resource repositioning device to reposition said at least a resource, in said grid network of nodes, in response to an incoming resource, said repositioning based on said determined position of said incoming resource; characterized, in that, said repositioning mechanism being guided by at least a step or a combination of steps or repetition of steps selected from a group of steps.

FIELD

This invention relates to the field of network systems and networkarchitecture.

Particularly, this invention relates to the field of load balancing andlocation management in network systems and network architecture.

Specifically, this invention relates to a dynamic resource repositioningload balancing and location management system and method.

BACKGROUND

A network system is defined as a group of nodes which are interconnectedin a pre-determined fashion. The nodes may work in a synchronous manner,in an asynchronous manner, in a collaborative manner, in a distinctivemanner, in a sequential manner, in a non-sequential manner, in adiscrete manner, in a pattern, out of a pattern, or in any type ofmanner predetermined by the intended use of the network.

In networking, load refers to the amount of data (traffic) being carriedby a network. One of the parameters of an efficient system, especially,of a network system is the amount of load that it handles.

For many loads; whether physical or virtual, load distribution is animportant function of network attributes. Load changes may be in theform of load addition, load deletion, or mere load change. Thiscomprises resource additional, resource deletion, resource changes, nodeaddition, node deletion, node changes, data addition, data deletion,data changes, and/or the like.

Network Load Balancing (NLB) is the management of traffic across anetwork.

In at least a first embodiment, Network Load Balancing distributesworkload across multiple CPUs, disk drives and other resources in aneffort to use network resources more efficiently and avoid networkoverload. Load balancing may be accomplished through software orhardware.

Network load balancing is an efficient and cost-effective solutiondesigned to enhance availability and scalability of Internetapplications by allowing system administrators to build clusters, whichare load balanced with incoming client requests.

In at least a second embodiment, a load balancer is a device that actsas a reverse proxy and distributes network or application traffic acrossa number of servers. Load balancers are used to increase capacity(concurrent users) and reliability of applications. They improve theoverall performance of applications by decreasing the burden on serversassociated with managing and maintaining application and networksessions, as well as by performing application-specific tasks.

In at least a third embodiment, Network Load Balancing distributes IPtraffic across multiple cluster hosts. It also ensures high availabilityby detecting host failures and automatically redistributing traffic tothe surviving hosts. Network Load Balancing provides remotecontrollability and supports rolling upgrades.

Typically, Network Load Balancing enables a network to deliver highperformance and failover protection

Network Load Balancing servers (also called hosts) in a clustercommunicate among themselves to provide key benefits, includingscalability and high availability (of nodes).

In at least a fourth embodiment, Network Load Balancing uses port rulesto customize load balancing. Port rules can select either multiple-hostor single-host load-balancing policies. Port rules also comprisehandling priority.

According to the prior art, one of the techniques for load distributionis a DHT (Distributed Hash Table) technique. This technique considerslogical distance between the nodes. This technique makes a choice ofdestination node to transfer the extra load on the basis of logicaldistance analysis, and not on physical distance measure.

According to the prior art, one of the techniques for load distributionis a Static Load Balancing technique. This technique is not suitable fordistributed applications.

According to the prior art, one of the techniques for load distributionDynamic Load Balancing technique. This technique is not suitable whenthe system in stable enough.

Furthermore, according to the prior art, all prior art technologies arenot scalable in a co-ordinated manner.

FIG. 1 illustrates one of the existing models of grid layout. Below isan associated Table 1.

TABLE 1 Number of No. of Time resources resources Instance availableremoved Grid-1 Grid-2 Grid-3 Grid-4 T1 32 * 4 = 128 0 32 32 32 32

FIG. 2 illustrates one more of the existing models of grid layout, whereresources and nodes have been removed. Below is an associated Table 2.

TABLE 2 Number of No. of Time resources resources Instance availableremoved Grid-1 Grid-2 Grid-3 Grid-4 T2 32 * 4 = 128 30 32 − 5 = 28 32 −7 = 28 32 − 10 = 22 32 − 8 = 24

SUMMARY

An object of the invention is to balance loads.

Another object of the invention is to balance loads, of any type, in anetwork.

Yet another object of the invention is to balance loads, of any type, ina network, when a load is removed.

Still another object of the invention is to provide a locationmanagement scheme for load balancing in order to balance resources overa given cluster to make best utilization of system (network).

Still another object of the invention is to provide a locationmanagement scheme for load balancing, upon removal or deletion ofresources, in order to balance resources over defined nodes in order tomake best utilization of system (network).

An additional object of the invention is to provide an efficient loadbalancing scheme for grid based networks and systems.

Yet an additional object of the invention is to provide a resourcerepositioning system and method for arrangement, displacement, andrepositioning of resources from one area to another area in apre-determined fashion such that network (comprising the resources) loadindex is kept constant up to n number of next removals.

Still an additional object of the invention is to provide a resourcerepositioning system and method for arrangement, displacement, andrepositioning of nodes from one area to another area in a pre-determinedfashion such that network (comprising the nodes) load index is keptconstant up to n number of next removals.

According to this invention, there is provided a dynamic resourcerepositioning load balancing and location management system in order toreposition existing resources in a grid network of nodes, in response toan outgoing resource from said grid network of nodes, said systemcomprises:

-   -   at least a first mapping mechanism in order to map topology of        said grid network of nodes, along with its resources;    -   at least a determination mechanism in order to determine at        least an outgoing resource's initial placement in terms of        relative position of said node that the resource currently        occupies and in terms of relative number of edges on which said        resource currently resides, said relative position being        selected from a corner node or an intermittent node in respect        of a designated grid, said relative number position also being        selected from an overlap position or a non-overlap position;    -   resource repositioning mechanism in order to reposition said at        least a resource, in said grid network of nodes, in response to        an outgoing resource, said repositioning based on said        determined position of said outgoing resource; characterised, in        that, said repositioning mechanism being guided by at least a        step or a combination of steps or repetition of steps selected        from a group of steps consisting of the following:    -   for any outgoing resource from an existing node, in a designated        grid, determined as being from a corner node and from a        non-overlapping node, moving one resource each from any two        intermittent nodes of non-overlapping adjacent edges, belonging        to that particular edge from where resource is removed;    -   for any outgoing resource from an existing node, in a designated        edge, determined as being from an intermittent node and from a        non-overlapping node, moving one resource from any one        intermittent node of non-overlapping adjacent edge to another        corner node of the edge from where said intermittent node's        resource is removed.

Typically, said at least a determination mechanism comprises at least afirst decision making mechanism adapted to decide if said existingresource is removed from an intermittent node.

Typically, said at least a determination mechanism comprises at least asecond decision making mechanism adapted to decide if said existing isremoved from a corner node.

Typically, said at least a determination mechanism comprises at least athird decision making mechanism adapted to decide if said outgoingresource belongs to one edge in order to term it as a non-overlappingresource.

Typically, said at least a determination mechanism comprises at least afourth decision making mechanism adapted to decide if said outgoingresource belongs to two edges in order to term it as an overlappingresource.

Typically, said at least a determination mechanism comprises at least afifth decision making mechanism to determine if number of overlaps iszero.

Typically, said at least a determination mechanism comprises at least asixth decision making mechanism to determine if number of overlaps istwo.

Typically, said at least a determination mechanism comprises at least aseventh decision making mechanism to determine if number of overlaps isfour.

Typically, said resource repositioning mechanism comprises at least afirst resource replacement task invoking mechanism in order to invoke afirst task if output of said at least a second decision makingmechanism, said fourth decision making mechanism, and said sixthdecision making mechanism is simultaneously true, wherein, output ofsaid second decision making mechanism being determined as a first cornernode, characterised, in that, said first task comprises following stepsto be performed at least once:

-   -   selecting an edge which is adjacent to a second corner node of        the edge from where said resource is removed;    -   selecting an intermittent node from said selected edge;    -   moving a resource from said selected intermittent node to its        adjacent overlapped corner node which belongs to an edge from        where said resource is removed;    -   moving resource from said second corner node of unselected edge,        to any intermittent node of adjacent edge to it; and    -   moving resource from any intermittent node of overlapped edge to        said first corner node from where said resource is removed.

Typically, said resource repositioning mechanism comprises at least asecond resource replacement task invoking mechanism in order to invoke asecond task if output of said at least a second decision makingmechanism, said fourth decision making mechanism, and said sixthdecision making mechanism is simultaneously true, wherein, output ofsaid second decision making mechanism being determined as a first cornernode, characterised, in that, said second task comprises following stepsto be performed at least once:

-   -   selecting two edges adjacent to said first corner node from        where said resource is removed;    -   from each edge, moving one resource from any adjacent        intermittent node to a second corner node from where said        resource is removed; and    -   moving resource from a second corner node of overlapped edge to        any adjacent intermittent node which belongs to adjacent        non-overlapped edge to that other node.

Typically, said resource repositioning mechanism comprises at least athird resource replacement task invoking mechanism in order to invoke athird task if output of said at least a second decision makingmechanism, said fourth decision making mechanism, and said sixthdecision making mechanism is simultaneously true, wherein, output ofsaid second decision making mechanism being determined as a first cornernode, characterised, in that, said third task comprises following stepsto be performed at least once:

-   -   moving resource from an intermittent node of non-overlapped edge        to node from where resource is removed; and    -   moving resource from an intermittent node of adjacent edge to a        corner node which is a common corner node of current edge and        the edge from said first corner node.

Typically, said resource repositioning mechanism comprises at least afourth resource replacement task invoking mechanism in order to invoke afourth task if output of said at least a first decision makingmechanism, said fourth decision making mechanism, and said sixthdecision making mechanism is simultaneously true, wherein, output ofsaid first decision making mechanism being determined as a firstintermittent node, characterised, in that, said fourth task comprisesfollowing steps to be performed at least once:

-   -   selecting any one corner node of edge from where said resource        was removed;    -   moving resource from any one intermittent node from any edge        adjacent to said selected corner node; and    -   moving resource from a second intermittent node of non-selected        edge to an adjacent edge's intermittent node.

Typically, said resource repositioning mechanism comprises at least afifth resource replacement task invoking mechanism in order to invoke afifth task if output of said at least a first decision making mechanism,said fourth decision making mechanism, and said sixth decision makingmechanism is simultaneously true, wherein, output of said first decisionmaking mechanism being determined as a first intermittent node,characterised, in that, said fifth task comprises following steps to beperformed at least once:

-   -   selecting any one corner node of edge from where said resource        was removed;    -   moving resource from any one intermittent node, each of both        edges adjacent to said selected corner node; and    -   moving resource from each of the other corner nodes of said        selected edge to their respective adjacent nodes' intermittent        nodes.

Typically, said resource repositioning mechanism comprises at least asixth resource replacement task invoking mechanism in order to invoke asixth task if output of said at least a first decision making mechanism,said fourth decision making mechanism, and said seventh decision makingmechanism is simultaneously true, wherein, output of said first decisionmaking mechanism being determined as a first intermittent node,characterised, in that, said sixth task comprises following steps to beperformed at least once:

-   -   adding a resource from any intermittent node to another corner        node of edge;    -   moving a resource from another corner node of non-selected edge        to said adjacent intermittent node belonging to adjacent edge;        and    -   moving resource from said intermittent node of overlapped edge        of which said added corner node and said another corner node        belongs.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates one of the existing models of grid layout; and

FIG. 2 illustrates one more of the existing models of grid layout, whereresources and nodes have been removed.

The invention will now be described in relation to the accompanyingdrawings, in which:

FIG. 3 illustrates a non-limiting exemplary embodiment of use of thesystem and method of this invention, wherein an initial step ofrestructuring takes place in order to be used by the system and methodof this invention;

FIG. 4 illustrates a non-limiting exemplary embodiment of use of thesystem and method of this invention, which is obtained after initialrestructuring of the grids of FIG. 3;

FIG. 5 illustrates a non-limiting exemplary embodiment of use of thesystem and method of this invention, which shows a virtual or physicalre-modeled initial structure of grid network upon which the system andmethod of this invention is acted;

FIG. 6 is another representation of the grid network of FIG. 5; and

FIG. 7 illustrates a schematic of the resource repositioning loadbalancing and location management system.

DETAILED DESCRIPTION

One of the problems is that when a job or item or task or node isremoved from an edge of a grid, load gets decreased on that edge. Here,load metric, as total number of resources available in a network, at agiven time, is considered. Hence, there is a need for a system andmethod that will make this metric static though removal of existingresources is going on. The system and method should also makerestructuring of resources in such a way that each grid contain samenumber of resources.

According to a non-limiting exemplary embodiment of a network, there maybe n-grids in the network/system. All grids have some subset ofresources. The number and type of resources inside the grid depends onthe demand of those resources inside the grid. This demand is attributedby the requests raised by user set in that area. A particular area hascertain attributes which decides what and how many requests are therefor the resource(s). Depending on this, the localization, number ofreplica created for the given resource, movement of resources isdecided. These elements will decide the frequency of load balancinginitiative and the resource imbalance.

Companies such as Google, Yahoo, Facebook, Microsoft, Amazon, Apple,Twitter, and the like generate, maintain, aggregate, and store largevolumes of data. Typically, these companies have separate infrastructurefor each region. The regions may be divided according to continents orregions re-defined by the companies such as Indian continent, South-EastAsian Continent, Asia Pacific region, North Americas, South Americas,Europe, Russia, Australia, Australasia, UK, China, Middle East, and thelike. The size and scope of this infrastructure heavily depends on theamount of requests issued per unit time in or for that region. Again, ifas per request rate, infrastructure is deleted, there will not be muchguarantee that same request rate will persist down the line. This is amajor problem to be solved. The total number of resources, provisioned,is proportionally same to the number of requests issued per unit time.Organizations are facing problems in deploying services to thesedifferent scenarios. So, it is of utmost requirement put by theseorganizations which is, that irrespective of any change i.e. increase ordecrease in the request rate, infrastructure should be same up to apre-determined manageable limit. The other problem, in this context, isthat although load is balanced to the particular grid, but at a globalscenario, (the entire region-wise grid for the specific organization),each grid with different capacity holdings reflects the total imbalancein terms of global consideration.

Furthermore, one of the problems discussed is a problem relating to thepigeonhole principle. E.g. if there are three nests and four birds, andall birds want to lay eggs, and the condition is that one bird can layeggs in one nest only and no other bird should use the nest used byanother bird, then ultimately, one bird cannot find a nest to lay an eggin. Correspondingly, in a network, the total number of users is morethan the available resources in a system, there is a problem, at hand.

According to another non-limiting exemplary embodiment, utilization ofmany energy resources for power generation is helpful in lower powerrequirement stages such that if one source is able to satisfy the powerneed then another one will can be removed to save resources. There areseveral factors, why decreased power is required. Considering themaximum power limit of one area in a city=n, if elements (consumingpower) are removed, then limit of same area=n−1. Hence, powerarrangements need to be made for n−1 nodes. This removal of existingpower consumer leads to at least two problems: 1) imbalanced network;and 2) difficulty in managing the network infrastructure. The proposedsolution to this problem lies in designing a system and method which,regardless of deletion of resources, nodes, or existing power consumer,balances the network framework to the number that was initially set tothe network framework. This should provide for a balancedinfrastructure, thereby making it easy to manage. Other advantage of theproposed solution is that there is no requirement to delete extraresources where reduced power requirement is there, characterized, inthat, the power consumer nodes, of this exemplary embodiment, need to beorganized in a rather ‘special’, ‘pre-determined’ manner such that itconforms to pre-determined rules of re-alignment.

For the purposes of this specification, the term, ‘resource’ comprisesload, objects, data, and the like.

For the purposes of this specification, the term, ‘node’ comprises alocation or a placeholder where a resource or a plurality of resourcesmay reside.

For the purposes of this specification, the term, ‘network’ or ‘grid’comprises a pool of nodes and resources, thereof. Typically, the gridhas a particular pattern or architecture, and the network includes asystem allowing interaction between two or more electronic devices, andincludes any form of inter/intra enterprise environment such as theworld wide web, Local Area Network (LAN), Wide Area Network (WAN),Storage Area Network (SAN) or any form of Intranet.

As used herein, the term “intermittent” includes “intermediary” and“interstitial.”

As used herein, the term “means” and “mechanism” includes acomputer-processor driven device with the named functionality, includinga determinator, repositioner, mapper, processor, locator, positioner,decider, etc. Such devices may further include permanent and transientdata storage as well as specific programming for the computer processorto execute their functions described below.

The terminology used herein is for the purpose of describing particularembodiments only and is not intended to be limiting of the invention. Asused herein, the singular forms “a”, “an” and “the” are intended toinclude the plural forms as well, unless the context clearly indicatesotherwise. It will be further understood that the terms “comprises”and/or “comprising,” when used in this specification, specify thepresence of stated features, integers, steps, operations, elements,and/or components, but do not preclude or rule out the presence oraddition of one or more other features, integers, steps, operations,elements, components, and/or groups thereof.

According to this invention, there is provided a dynamic resourcerepositioning load balancing and location management system and method.

FIG. 7 illustrates a schematic of the resource repositioning loadbalancing and location management system.

In accordance with an embodiment of this invention, there is provided afirst mapping mechanism (MP1) in order to map topology of said gridnetwork (GNR) of nodes, along with its resources.

Typically, for any arrangement of nodes, and resources thereof, there isa need for restructuring the topology of the grid in accordance withpre-defined rules. These pre-defined rules ensure that the restructuredtopology is in the format of rectangular or square grids. In at leastone non-limiting exemplary embodiment, the arrangement of nodes, andresources thereof is in accordance with FIGS. 3 to 5 of the accompanyingdrawings. The rectangular or square grids may be aligned end to end suchthat edges may be shared. This may in 2-dimensional or in 3-dimensionalformat. The system and method of this invention will be applied to thisrestructured topology. In at least one embodiment, this restructuring isphysical. In at least an alternative embodiment, this restructuring islogical or virtual.

An outgoing resource requested by node imbalances the grid network,which is to be balanced. Assuming that the existing grid network ofresources is balanced, an outgoing resource may off balance the gridnetwork of resources if other resources are not repositionedappropriately. The system and method of this invention ensuresappropriate placement or replacement of resources.

In accordance with another embodiment of this invention, there isprovided a determination mechanism (DTM) in order to determine therelative placement or relative position of the outgoing resource and inorder to further determine the relative number of edges on which theoutgoing resource resides. This determined relative placement orrelative position is the instantaneous placement or position, meaningthat this is the first or initial placement or position of the outgoingresource. The relative placement or relative position of the incomingresource is selected from the placement of position being a corner nodeor an intermittent node. This determined relative number of edges is theinstantaneous number of edges that the incoming resource shared, meaningthat these are the number of edges which are firstly or initially sharedduring the first or initial placement or position of the outgoingresource.

In accordance with another embodiment of this invention, there isprovided a control layer mechanism adapted to control location ofresource(s) to be restructured once a resource is removed. Firstly, anoutgoing resource is removed, its position is determined, and resourcesare restructured depending upon pre-defined rules of the network hostingthe nodes and resources. These resources need to be located orre-located upon specific nodes such that the entire network is balanced.

In accordance with another embodiment of this invention, there isprovided a first decision making means (DM1) adapted to decide if theoutgoing resource that is to be removed is an intermittent node or not.

In accordance with another embodiment of this invention, there isprovided a second decision making means (DM2) adapted to decide if theoutgoing resource that is to be removed is a corner node or not.

In accordance with another embodiment of this invention, there isprovided a third decision making means (DM3) adapted to decide if theoutgoing resource that is to be removed belongs to a single edge or not.

In accordance with another embodiment of this invention, there isprovided a fourth decision making means (DM4) adapted to decide if theoutgoing resource that is to be removed belongs to two or more edges ornot.

In accordance with another embodiment of this invention, there isprovided a fifth decision making mechanism to determine if the outgoingresource that is to be removed is placed on a node where number ofoverlaps is zero.

In accordance with another embodiment of this invention, there isprovided sixth decision making mechanism to determine if the outgoingresource that is to be removed is placed on a node where number ofoverlaps is two.

In accordance with another embodiment of this invention, there isprovided a seventh decision making mechanism to determine if theoutgoing resource that is to be removed is placed on a node where numberof overlaps is four.

In accordance with still another embodiment of this invention, there isprovided a first resource replacement task invoking mechanism (RT1)configured to be activated if the output of the second decision makingmechanism, the fourth decision making mechanism, as well as the outputof the sixth decision making mechanism is concurrently true. This meansthat the outgoing resource that is to be removed from the grid networkof resources belongs to a corner node, belongs to an overlapping edge,with 2 numbers of overlap.

The task associated with the first resource replacement task invokingmechanism is as follows:

-   -   selecting an edge which is adjacent to a second corner node of        the edge from where said resource is removed;    -   selecting an intermittent node from said selected edge;    -   moving a resource from said selected intermittent node to its        adjacent overlapped corner node which belongs to an edge from        where said resource is removed;    -   moving resource from said second corner node of unselected edge,        to any intermittent node of adjacent edge to it; and    -   moving resource from any intermittent node of overlapped edge to        said first corner node from where said resource is removed.

This first task needs to be followed at least once.

This first resource replacement task invoking mechanism may beconfigured to use buffer memories, serial buses, parallel buses, and/orshift registers, resource locators, resource handlers; which are alladvantageously configured to perform the task associated with it, asdisclosed above.

In accordance with still another embodiment of this invention, there isprovided a second resource replacement task invoking mechanism (RT2)configured to be activated if the output of the second decision makingmechanism, the fourth decision making mechanism, as well as the outputof the sixth decision making mechanism is concurrently true. This meansthat the outgoing resource that is to be removed from the grid networkof resources belongs to a corner node, belongs to an overlapping edge,with 2 numbers of overlap.

The task associated with the second resource replacement task invokingmechanism is as follows:

-   -   selecting two edges adjacent to said first corner node from        where said resource is removed;    -   from each edge, moving one resource from any adjacent        intermittent node to a second corner node from where said        resource is removed; and    -   moving resource from a second corner node of overlapped edge to        any adjacent intermittent node which belongs to adjacent        non-overlapped edge to that other node.

This second task needs to be followed at least once.

This second resource replacement task invoking mechanism may beconfigured to use buffer memories, serial buses, parallel buses, and/orshift registers, resource locators, resource handlers; which are alladvantageously configured to perform the task associated with it, asdisclosed above.

In accordance with still another embodiment of this invention, there isprovided a third resource replacement task invoking mechanism (RT3)configured to be activated if the output of the second decision makingmechanism, the fourth decision making mechanism, as well as the outputof the sixth decision making mechanism is concurrently true. This meansthat the outgoing resource that is to be removed from the grid networkof resources belongs to a corner node, belongs to an overlapping edge,with 2 numbers of overlap.

The task associated with the third resource replacement task invokingmechanism is as follows:

-   -   moving resource from an intermittent node of non-overlapped edge        to node from where resource is removed; and    -   moving resource from an intermittent node of adjacent edge to a        corner node which is a common corner node of current edge and        the edge from said first corner node.

This third task needs to be followed at least once.

This third resource replacement task invoking mechanism may beconfigured to use buffer memories, serial buses, parallel buses, and/orshift registers, resource locators, resource handlers; which are alladvantageously configured to perform the task associated with it, asdisclosed above.

In accordance with still another embodiment of this invention, there isprovided a fourth resource replacement task invoking mechanism (RT4)configured to be activated if the output of the first decision makingmechanism, the fourth decision making mechanism, as well as the outputof the sixth decision making mechanism is concurrently true. This meansthat the outgoing resource that is to be removed from the grid networkof resources belongs to an intermittent node, belongs to an overlappingedge, with 2 numbers of overlap.

The task associated with the fourth resource replacement task invokingmechanism is as follows:

-   -   selecting any one corner node of edge from where said resource        was removed;    -   moving resource from any one intermittent node from any edge        adjacent to said selected corner node; and    -   moving resource from a second intermittent node of non-selected        edge to an adjacent edge's intermittent node.

This fourth task needs to be followed at least once.

This fourth resource replacement task invoking mechanism may beconfigured to use buffer memories, serial buses, parallel buses, and/orshift registers, resource locators, resource handlers; which are alladvantageously configured to perform the task associated with it, asdisclosed above.

In accordance with still another embodiment of this invention, there isprovided a fifth resource replacement task invoking mechanism (RT5)configured to be activated if the output of the first decision makingmechanism, the fourth decision making mechanism, as well as the outputof the sixth decision making mechanism is concurrently true. This meansthat the outgoing resource that is to be removed from the grid networkof resources belongs to an intermittent node, belongs to an overlappingedge, with 2 numbers of overlap.

The task associated with the fifth resource replacement task invokingmechanism is as follows:

-   -   selecting any one corner node of edge from where said resource        was removed;    -   moving resource from any one intermittent node, each of both        edges adjacent to said selected corner node; and    -   moving resource from each of the other corner nodes of said        selected edge to their respective adjacent nodes' intermittent        nodes.

This fifth task needs to be followed at least once.

This fifth resource replacement task invoking mechanism may beconfigured to use buffer memories, serial buses, parallel buses, and/orshift registers, resource locators, resource handlers; which are alladvantageously configured to perform the task associated with it, asdisclosed above.

In accordance with still another embodiment of this invention, there isprovided a sixth resource replacement task invoking mechanism (RT6)configured to be activated if the output of the first decision makingmechanism, the fourth decision making mechanism, as well as the outputof the sixth decision making mechanism is concurrently true. This meansthat the outgoing resource that is to be removed from the grid networkof resources belongs to an intermittent node, belongs to an overlappingedge, with 2 numbers of overlap.

The task associated with the sixth resource replacement task invokingmechanism is as follows:

-   -   adding a resource from any intermittent node to another corner        node of edge;    -   moving a resource from another corner node of non-selected edge        to said adjacent intermittent node belonging to adjacent edge;        and    -   moving resource from said intermittent node of overlapped edge        of which said added corner node and said another corner node        belongs.

This sixth task needs to be followed at least once.

This sixth resource replacement task invoking mechanism may beconfigured to use buffer memories, serial buses, parallel buses, and/orshift registers, resource locators, resource handlers; which are alladvantageously configured to perform the task associated with it, asdisclosed above.

FIG. 3 illustrates a non-limiting exemplary embodiment of use of thesystem and method of this invention, wherein an initial step ofrestructuring takes place in order to be used by the system and methodof this invention. Below is an associated Table 3.

TABLE 3 Number of No. of Time resources resources Instance availableremoved Grid-1 Grid-2 Grid-3 Grid-4 T3 32 * 4 = 128 30 Shift the coreShift the core Shift the core Shift the core modules to the modules tothe modules to the modules to the closest corner of closest corner ofclosest corner of closest corner of the respective grid. the respectivegrid. the respective grid. the respective grid.

FIG. 4 illustrates a non-limiting exemplary embodiment of use of thesystem and method of this invention, which is obtained after initialrestructuring of the grids of FIG. 3. Below is an associated Table 4.

TABLE 4 Number of No. of Time resources resources Instance availableremoved Grid-1 Grid-2 Grid-3 Grid-4 T4 32 * 4 = 128 30 Replace theReplace the Replace the Replace the closest corner of closest corner ofclosest corner of closest corner of the respective grid the respectivegrid the respective grid the respective grid with core module. with coremodule. with core module. with core module.

FIG. 5 illustrates a non-limiting exemplary embodiment of use of thesystem and method of this invention, which shows a virtual or physicalre-modeled initial structure of grid network upon which the system andmethod of this invention is acted. Below is an associated Table 5.

TABLE 5 Number of No. of Time resources resources Instance availableremoved Grid-1 Grid-2 Grid-3 Grid-4 T5 32 * 4 = 128 30 Merge All theMerge All the Merge All the Merge All the grids in such a way grids insuch a way grids in such a way grids in such a way that commonality thatcommonality that commonality that commonality among resources amongresources among resources among resources as a result of as a result ofas a result of as a result of replication belongs replication belongsreplication belongs replication belongs to the shared to the shared tothe shared to the shared modules between modules between modules betweenmodules between respective edges. respective edges. respective edges.respective edges. i.e. node 6 contains i.e. node 6 contains i.e. node 6contains i.e. node 6 contains resources shared resources sharedresources shared resources shared by all four edges. by all four edgesby all four edges by all four edges

FIG. 6 is another representation of the grid network of FIG. 5 where thereference numerals are as follows:

-   -   A—outgoing resource is initially located on intermittent node        belong to one edge (before load balancing system and method of        this invention);    -   B—outgoing resource is initially located on intermittent node        belong to two edges (before load balancing system and method of        this invention);    -   C—outgoing resource is initially located on corner node belong        to one edge (before load balancing system and method of this        invention); and    -   D—outgoing resource is initially located on corner node belong        to two edges (before load balancing system and method of this        invention).

Furthermore, according to a non-limiting exemplary embodiment, thissystem and method steps are proved below. Once the grid layout ischanged to unbalanced condition, the system and method is applied tocheck whether the given number of resources remain constant or not; in abalanced condition.The system and method considers the total number ofresources available inside grid as load index. When the system andmethod adds resource, load index will be increased, and when the systemand method deletes the resource, load index will decrease. Below is anassociated Table 6.

TABLE 6 Number of No. of resources resources Stage available removedGrid-1 Grid-2 Grid-3 Grid-4 T1 32 * 4 = 128 0 32 32 32 32 T2 32 * 4 =128 30 32 − 5 = 27 32 − 7 = 25 32 − 10 = 22 32 − 8 = 24 128 − 30 = 98 T332 * 4 = 128 30 Shift the core Shift the core Shift the core Shift thecore 128 − 30 = 98 modules to the modules to the modules to the modulesto the closest corner of closest corner of closest corner of closestcorner of the respective grid. the respective grid. the respective grid.the respective grid. T4 32 * 4 = 128 30 Replace the Replace the Replacethe Replace the 128 − 30 = 98 closest corner of closest corner ofclosest corner of closest corner of the respective grid the respectivegrid the respective grid the respective grid with core module. with coremodule. with core module. with core module. T5 32 * 4 = 128 30 Merge Allthe grids in such a way that commonality among resources as a 128 − 30 =98 result of replication belongs to the shared modules betweenrespective grids. i.e. node 6 contains resources shared by all fourgrids. Apply above algorithm steps based on which location resourceremoval taken place. Execution will keep the resource index constantirrespective of certain number of resource removals. T6 32 * 4 = 128 3032 32 32 32

Once grid reaches step 5, the system and method of this invention willget executed in step 6 which will balance the grid in such a way thattotal number of resources available in the individual grid with modifiedstructure (stage T5) will be 32. Though stage 2 results into modifiedcount in the resources available in individual grid i.e. (Grid-1:32−5=27, Grid-2: 32−7=25, Grid-2: 32−10=22, Grid-2: 32−8=24). Hence thesystem and method provides a technical advancement, in that, aninnovative relocation scheme is provided in such a way that each gridshows a complete balanced view at the given instance, though resourcesgets added or get removed from grid.

The data, in each of the components, means, modules, mechanisms, units,devices of the system and method may be ‘encrypted’ and suitably‘decrypted’ when required.

The systems described herein can be made accessible through a portal oran interface which is a part of, or may be connected to, an internalnetwork or an external network, such as the Internet or any similarportal. The portals or interfaces are accessed by one or more of usersthrough an electronic device, whereby the user may send and receive datato the portal or interface which gets stored in at least one memorydevice or at least one data storage device or at least one server, andutilises at least one processing unit. The portal or interface incombination with one or more of memory device, data storage device,processing unit and serves, form an embedded computing setup, and may beused by, or used in, one or more of a non-transitory, computer readablemedium. In at least one embodiment, the embedded computing setup andoptionally one or more of a non-transitory, computer readable medium, inrelation with, and in combination with the said portal or interfaceforms one of the systems of the invention. Typical examples of a portalor interface may be selected from but is not limited to a website, anexecutable software program or a software application.

The systems and methods may simultaneously involve more than one user ormore than one data storage device or more than one host server or anycombination thereof.

A user may provide user input through any suitable input device or inputmechanism such as but not limited to a keyboard, a mouse, a joystick, atouchpad, a virtual keyboard, a virtual data entry user interface, avirtual dial pad, a software or a program, a scanner, a remote device, amicrophone, a webcam, a camera, a fingerprint scanner, a cave, pointingstick

The systems and methods can be practiced using any electronic devicewhich may be connected to one or more of other electronic device withwires or wirelessly which may use technologies such as but not limitedto, Bluetooth, Wi-Fi, Wimax. This will also extend to use of theaforesaid technologies to provide an authentication key or access key orelectronic device based unique key or any combination thereof.

In at least one embodiment, one or more user can be blocked or deniedaccess to one or more of the aspects of the invention.

Encryption can be accomplished using any encryption technology, such asthe process of converting digital information into a new form using akey or a code or a program, wherein the new form is unintelligible orindecipherable to a user or a thief or a hacker or a spammer. The term‘encryption’ includes encoding, compressing, or any other translating ofthe digital content. The encryption of the digital media content can beperformed in accordance with any technology including utilizing anencryption algorithm. The encryption algorithm utilized is not hardwaredependent and may change depending on the digital content. For example,a different algorithm may be utilized for different websites orprograms. The term ‘encryption’ further includes one or more aspects ofauthentication, entitlement, data integrity, access control,confidentiality, segmentation, information control, and combinationsthereof.

The described embodiments may be implemented as a system, method,apparatus or article of manufacture using standard programming and/orengineering techniques related to software, firmware, hardware, or anycombination thereof. The described operations may be implemented as codemaintained in a “non-transitory, computer readable medium”, where aprocessor may read and execute the code from the non-transitory,computer readable medium. A non-transitory, computer readable medium maycomprise media such as magnetic storage medium (e.g., hard disk drives,floppy disks, tape, etc.), optical storage (CD-ROMs, DVDs, opticaldisks, etc.), volatile and non-volatile memory devices (e.g., EEPROMs,ROMs, PROMs, RAMs, DRAMs, SRAMs, Flash Memory, firmware, programmablelogic, etc.), etc. The code implementing the described operations mayfurther be implemented in hardware logic (e.g., an integrated circuitchip, Programmable Gate Array (PGA), Application Specific IntegratedCircuit (ASIC), etc.).

The systems and methods can be practiced using any electronic device. Anelectronic device for the purpose of this invention is selected from anydevice capable of processing or representing data to a user andproviding access to a network or any system similar to the internet,wherein the electronic device may be selected from but not limited to,personal computers, tablet computers, mobile phones, laptop computers,palmtops, portable media players, and personal digital assistants. In anembodiment, the computer readable medium data storage unit or datastorage device is selected from a set of but not limited to USB flashdrive (pen drive), memory card, optical data storage discs, hard diskdrive, magnetic disk, magnetic tape data storage device, data server andmolecular memory.

The process steps, method steps, algorithms or the like may be describedin a sequential order, such processes, methods and algorithms may beconfigured to work in alternate orders. In other words, any sequence ororder of steps that may be described does not necessarily indicate arequirement that the steps be performed in that order. The steps ofprocesses described herein may be performed in any order practical.Further, some steps may be performed simultaneously, in parallel, orconcurrently.

Still further, the code implementing the described operations may beimplemented in “transmission signals”, where transmission signals maypropagate through space or through a transmission media, such as anoptical fibre, copper wire, etc. The transmission signals in which thecode or logic is encoded may further comprise a wireless signal,satellite transmission, radio waves, infrared signals, Bluetooth, etc.The transmission signals in which the code or logic is encoded iscapable of being transmitted by a transmitting station and received by areceiving station, where the code or logic encoded in the transmissionsignal may be decoded and stored in hardware or a non-transitory,computer readable medium at the receiving and transmitting stations ordevices. An “article of manufacture” comprises non-transitory, computerreadable medium or hardware logic, and/or transmission signals in whichcode may be implemented. A device in which the code implementing thedescribed embodiments of operations is encoded may comprise anon-transitory, computer readable medium or hardware logic. Of course,those skilled in the art will recognize that many modifications may bemade to this configuration without departing from the scope of thepresent invention, and that the article of manufacture may comprisesuitable information bearing medium known in the art.

While this detailed description has disclosed certain specificembodiments for illustrative purposes, various modifications will beapparent to those skilled in the art which do not constitute departuresfrom the spirit and scope of the invention as defined in the followingclaims, and it is to be distinctly understood that the foregoingdescriptive matter is to be interpreted merely as illustrative of theinvention and not as a limitation.

1. A dynamic resource repositioning load balancing and locationmanagement method to reposition existing resources in a grid network ofnodes in response to an outgoing resource from the grid network ofnodes, the method comprising: mapping topology of the grid network ofnodes, along with its resources; determining at least an initialplacement of an outgoing resource in terms of a relative position of thenode that the resource currently occupies and in terms of a number ofrelative edges on which the resource currently resides, the relativeposition being selected from a corner node or an intermittent node inthe grid, the position also being selected from an overlap position or anon-overlap position; and repositioning the at least a resource, in thegrid network of nodes, in response to an outgoing resource, therepositioning based on the determined position of the outgoing resource,wherein the repositioning includes at least one of, for any outgoingresource from an existing node, in the grid, determined as being from acorner node and from a non-overlapping node, moving one resource eachfrom any two Intermittent nodes of non-overlapping adjacent edgesbelonging to an edge from where resource is removed, and for anyoutgoing resource from an existing node, in the grid, determined asbeing from an intermittent node and from a non-overlapping node, movingone resource from an intermittent node of a non-overlapping adjacentedge to another corner node of the edge from where the resource isremoved.
 2. The method of claim 1, wherein, the determining includes afirst determining if the outgoing resource is removed from anintermittent node.
 3. The method of claim 2, wherein, the determiningincludes a second determining if the outgoing resource is removed from acorner node.
 4. The method of claim 3, wherein, the determining includesa third determining the outgoing resource as a non-overlapping resourceif the outgoing resource belongs to one edge.
 5. The method of claim 4,wherein, the determining includes a fourth determining that the outgoingresource is an overlapping resource if the outgoing resource belongs totwo edges.
 6. The method of claim 5, wherein, the determining includes afifth determining if a number of overlaps is zero,
 7. The method ofclaim 6, wherein, the determining includes a sixth determining if anumber of overlaps is two.
 8. The method of claim 7, wherein, thedetermining includes a seventh determining if a number of overlaps isfour.
 9. The method of claim 8, wherein, if the second determining,thefourth determining, and the sixth determining are simultaneously true,then the second determining determines a first corner node and therepositioning includes at least one of, selecting an edge which isadjacent to a second corner node of the edge from where the resource isremoved, selecting an intermittent node from the selected edge, moving aresource from the selected intermittent node to its adjacent overlappedcorner node which belongs to an edge from where the resource is removed,moving a resource from the second corner node of unselected edge, to anyintermittent node of adjacent edge to it, and moving a resource from anyintermittent node of overlapped edge to the first corner node from wherethe resource is removed.
 10. The method of claim 8, wherein, if thesecond determining, the fourth determining, and the sixth determiningare simultaneously true, then the second determining determines a firstcorner node and the repositioning includes at least one of, selectingtwo edges adjacent to the first corner node from where the resource isremoved; from each edge, moving one resource from any adjacentintermittent node to a second corner node from where the resource isremoved, and moving a resource from a second corner node of overlappededge to any adjacent intermittent node which belongs to adjacentnon-overlapped edge to that other node.
 11. The method of claim 8,wherein, if the second determining, the fourth determining, and thesixth determining are simultaneously true, then the second determiningdetermines a first corner node and the repositioning includes at leastone of, moving a resource from an intermittent node of non-overlappededge to a node from where resource is removed, and moving a resourcefrom an intermittent node of an adjacent edge to a corner node which isa common corner node of current edge and the edge from the first cornernode.
 12. The method of claim 8, wherein, if the first determining, thefourth determining, and the sixth determining are simultaneously true,then the first determining determines a first intermittent node and therepositioning includes at least one of, selecting any one corner node ofan edge from where the resource was removed, moving a resource from anyone interittent node from any edge adjacent to the selected corner node,and moving a resource from a second intermittent node of a non-selectededge to an adjacent edge's intermittent node.
 13. The method of claim 8,wherein, if the first determining, the fourth determining, and the sixthdetermining are simultaneously true, then the first determiningdetermines a first intermittent node and the repositioning includes atleast one of, selecting any one corner node of an edge from where theresource was removed, moving a resource from any one intermittentnodeadjacent to the selected corner node, and moving resource from each ofthe other corner nodes of the selected edge to an intermittent node of arespective adjacent node.
 14. The method of claim 1, wherein, if thefirst determining, the fourth determining, and the seventh determiningare simultaneously true, then the first determining determines a firstintermittent node and the repositioning includes at least one of, addinga resource from any intermittent node to another corner node of an edge,moving a resource from another corner node of a non-selected edge to theadjacent intermittent node belonging to an adjacent edge, and moving aresource from the intermittent node of an overlapped edge of which theadded corner node and another corner node belongs.
 15. A dynamicresource repositioning load balancing and location management system inorder to reposition an outgoing resource in a grid network of nodes,said the system comprising: a computer processor configured to, maptopology of the grid network of nodes, along with its resources;determine at least an initial placement of an outgoing resource in termsof a relative position of the node that the resource currently occupiesand in terms of a number of relative edges on which the resourcecurrently resides, the relative position being selected from a cornernode or an intermittent node in the grid, the position also beingselected from an overlap position or a non-overlap position; andreposition another resource, in the grid network of nodes, in responseto an outgoing resource, the repositioning based on the determinedposition of the outgoing resource, wherein the repositioning includes atleast one of, for any outgoing resource from an existing node, in thegrid, determined as being from a corner node and from a non-overlappingnode, moving one resource each from any two intermittent nodes ofnon-overlapping adjacent edges belonging to an edge from where resourceis removed, and for any outgoing resource from an existing node, in thegrid, determined as being from an intermittent node and from anon-overlapping node, moving one resource from an intermittent node of anon-overlapping adjacent edge to another corner node of the edge fromwhere the resource is removed.
 16. The system of claim 15, wherein thedetermining includes, a first determining if the outgoing resource isremoved from an intermittent node, a second determining if the outgoingresource is removed from a corner node, a third determining the outgoingresource as a non-overlapping resource if the outgoing resource belongsto one edge, a fourth determining that the outgoing resource s anoverlapping resource if the outgoing resource belongs to two edges, afifth determining if a number of overlaps is zero, a sixth determiningif a number of overlaps is two, a seventh determining if a number ofoverlaps is four.
 17. The method of claim 16, wherein, if the seconddetermining, the fourth determining, and the sixth determining aresimultaneously true, then the second determining determines a firstcorner node and the repositioning includes at least one of, selecting anedge which is adjacent to a second corner node of the edge from wherethe resource is removed, selecting an intermittent node from theselected edge, moving a resource from the selected intermittent node toits adjacent overlapped corner node which belongs to an edge from wherethe resource is removed, moving a resource from the second corner nodeof unselected edge, to any intermittent node of adjacent edge to it, andmoving a resource from any intermittent node of overlapped edge to thefirst corner node from where the resource is removed.
 18. The method ofclaim 16, wherein, if the second determining, the fourth determining,and the sixth determining are simultaneously true, then the seconddetermining determines a first corner node and the repositioningincludes at least one of, selecting two edges adjacent to the firstcorner node from where the resource is removed; from each edge, movingone resource from any adjacent intermittent node to a second corner nodefrom where the resource is removed, and moving a resource from a secondcorner node of overlapped edge to any adjacent intermittent node whichbelongs to adjacent non-overlapped edge to that other node.
 19. Themethod of claim 16, wherein, if the second determining, the fourthdetermining, and the sixth determining are simultaneously true, then thesecond determining determines a first corner node and the repositioningincludes at least one of, moving a resource from an intermittent node ofnon-overlapped edge to a node from where resource is removed, and movinga resource from an intermittent node of an adjacent edge to a cornernode which is a common corner node of current edge and the edge from thefirst corner node.
 20. The method of claim 16, wherein, if the firstdetermining, the fourth determining, and the sixth determining aresimultaneously true, then the first determining determines a firstintermittent node and the repositioning includes at least one of,selecting any one corner node of an edge from where the resource wasremoved, moving a resource from any one Intermittent node from any edgeadjacent to the selected corner node, and moving a resource from asecond intermittent node of a non-selected edge to an adjacent edge'sintermittent node.